Resistance characterizations of equiarboreal graphs

A weighted (unweighted) graph $G$ is called equiarboreal if the sum of weights (the number) of spanning trees containing a given edge in $G$ is independent of the choice of edge. In this paper, we give some resistance characterizations of equiarboreal weighted and unweighted graphs, and obtain the necessary and sufficient conditions for $k$-subdivision graphs, iterated double graphs, line graphs of regular graphs and duals of planar graphs to be equiarboreal. Applying these results, we obtain new infinite families of equiarboreal graphs, including iterated double graphs of 1-walk-regular graphs, line graphs of triangle-free 2-walk-regular graphs, and duals of equiarboreal planar graphs.     

The isometric extension problem between unit spheres of two separable Banach spaces

In this article, we use some analytic and geometric characters of the smooth points in a sphere to study the isometric extension problem in the separable or reflexive real Banach spaces. We obtain that under some condition the answer to this problem is affirmative.     

On weighting two criteria with a parameter in combinatorial optimization problems

Two criteria in a combinatorial problem are often combined in a weighted sum objective using a weighting parameter between 0 and 1. For special problem types, e.g., when one of the criteria is a bottleneck value, efficient algorithms are known that solve for a given value of the weighting parameter.     

拓扑空间关于子基的紧致性

覆盖方法的应用在粗糙集理论研究中越来越受到重视,其中拓扑空间的子集关于子基的内部和闭包两个概念尤为重要.在由它们导入的关于子基的开集,闭集的基础上,给出了拓扑空间关于子基的紧致性概念,并研究它的性质,得到一般拓扑空间中紧致性的一种推广.